Sliding block codes between shift spaces over infinite alphabets
نویسندگان
چکیده
منابع مشابه
Sliding block codes between shift spaces over infinite alphabets
Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions...
متن کاملAutomata over Infinite Alphabets
In many contexts such as validation of XML data, software model checking and parametrized verification, the systems studied are naturally abstracted as finite state automata, but whose input alphabet is infinite. While use of such automata for verification requires that the non-emptiness problem be decidable, ensuring this is non-trivial, since the space of configurations of such automata is in...
متن کاملTree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.
متن کاملVariable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of automata, and in particular, regular automata, to infinite alphabets. Existing formalisms of such automata cope with the infiniteness of the alphabet by adding to the automaton a set of registers or pebbles, or by attributing the alphabet by labels from an auxiliary finite alphabet that is read by an intermediate t...
متن کاملCounting Multiplicity over Infinite Alphabets
In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2016
ISSN: 0025-584X
DOI: 10.1002/mana.201500309